import java.util.Arrays;
import java.util.Scanner;

public class testToday {
    public static int Max1(int x,int y){
        if(x>y){
           return x;
        }else{
            return y;
        }
    }
    public static int Max2(int x,int y,int c){
        int ret = Max1(x,y);
        if(c>ret){
            return c;
        }else{
            return ret;
        }
    }
    public static void main(String[] args) {
       int a = 3;
       int b = 5;
       int c= 10;
        System.out.println(Max2(a,b,c));

    }




        public static void main5 (String[] args){
            int[] array = {1, 2, 3, 4, 5, 6};
            int left = 0;
            int right = array.length - 1;
            while (left < right) {
                while (left<right && array[left]%2 != 0){
                    left++;
                }
                while (left<right && array[right]%2 == 0){
                    right--;
                }
                int tmp = array[left];
                array[left] = array[right];
                array[right] = tmp;
            }
            System.out.println(Arrays.toString(array));
            }



                               //阶乘
    public static void Fact(int n) {
        int i = 1;
        int sum = 1;
        while(i<=n){
            sum = sum*i;
            i++;
        }
        System.out.println(sum);
    }
    public static void main4(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        Fact(n);
    }
                             //阶乘之和
    public static void Add(int n) {
        int i = 1;
        int sum = 1;
        while(i<=n){
            sum = sum*i;
            i++;
            }
        System.out.println(sum);
    }
    public static void main3(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        Add(n);
    }
                              //fib数列
    public static int fib(int n) {
            if(n==1||n==2){
                return 1;
            }
            int f1 = 1;
            int f2 = 1;
            int f3 = 0;
            for(int i = 3;i<=n;i++){ //从第三项开始
                f3 = f1+f2;
                f1=f2;
                f2=f3;
            }
            return f3;
    }
    public static void main2(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        System.out.println(fib(n));
    }
                               //找出只出现一次的数
    public static void main1(String[] args) {
        int [] array  = {1,2,3,4,3,2,1};
        int sum = array[0];
        for(int i = 1;i<array.length;i++){
            sum = sum^array[i];
        }
        System.out.println(sum);
    }
}
